Bounds on the degree of APN polynomials: the case of x-1 + g(x)
نویسندگان
چکیده
We prove that functions f : F2m → F2m of the form f(x) = x + g(x) where g is any non-affine polynomial are APN on at most a finite number of fields F2m . Furthermore we prove that when the degree of g is less then 7 such functions are APN only if m ≤ 3 where these functions are equivalent to x.
منابع مشابه
Girth, minimum degree, independence, and broadcast independence
An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...
متن کاملOn the Dynamics of the Family axd(x − 1) + x
In this paper we consider the dynamics of the real polynomials of degree d + 1 with a fixed point of multiplicity d ≥ 2. Such polynomials are conjugate to fa,d(x) = axd(x−1)+x, a ∈ R{0}, d ∈ N. Our aim is to study the dynamics fa,d in some special cases.
متن کاملOn a class of quadratic polynomials with no zeros and its application to APN functions
We show that the there exists an infinite family of APN functions of the form F (x) = x s +x k+s +2 k + cx k+s + c k x k +2 s + δx k , over F22k , where k is an even integer and gcd(2k, s) = 1, 3 ∤ k. This is actually a proposed APN family of Lilya Budaghyan and Claude Carlet who show in [6] that the function is APN when there exists c such that the polynomial y s+1+ cy s + c k y+1 = 0 has no s...
متن کاملComputing the First and Third Zagreb Polynomials of Cartesian Product of Graphs
Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as: ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , ) euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.
متن کاملProgress Towards the Conjecture on APN Functions and Absolutely Irreducible Polynomials
Almost Perfect Nonlinear (APN) functions are very useful in cryptography, when they are used as S-Boxes, because of their good resistance to differential cryptanalysis. An APN function f : F2n → F2n is called exceptional APN if it is APN on infinitely many extensions of F2n . Aubry, McGuire and Rodier conjectured that the only exceptional APN functions are the Gold and the Kasami-Welch monomial...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 59 شماره
صفحات -
تاریخ انتشار 2011